On computing graph minor obstruction sets
نویسندگان
چکیده
منابع مشابه
On computing graph minor obstruction sets
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a nite set of forbidden substructures, the obstructions for the property. We prove several general theorems regarding the computation of obstruction sets from other information about a family of graphs. The methods can be adapted to other partial orders on graph...
متن کاملA Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals
The major results of Robertson and Seymour on graph well-quasi-ordering establish nonconstructively that many natural graph properties that constitute ideals in the minor or immersion orders are characterized by a nite set of forbidden substructures termed the obstructions for the property. This raises the question of what general kinds of information about an ideal are su cient, or insu cient,...
متن کاملOpen Problems related to computing obstruction sets
Robertson and Seymour proved Wagner’s famous Conjecture and showed that every minor ideal has a polynomial time decision algorithm. The algorithm uses the obstructions of the minor ideal. By Robertson and Seymour’s proof we know that there are only finitely many such obstructions. Nevertheless, the proof is non-constructive and for many minor ideals we do not know the obstructions. Since the 19...
متن کاملFinding Minor - Order Obstruction Sets : Feedback Vertex Set 2
We describe an application of an obstruction set computation platform that identiies the previously unknown obstruction sets for the k-Feedback Vertex Set problem, for k = 1 and k = 2. Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem (GMT). It has been known for several years that, in principle, obstruction sets can be mechanically c...
متن کاملOn Computing the Subset Graph of a Collection of Sets
Let a given collection of sets have size N measured by the sum of the cardinalities. Yellin and Jutla presented an algorithm which constructed the partial order induced by the subset relation (a \subset graph") in O(N 2 = log N) operations over a dictionary ADT, and exhibited a collection whose subset graph had (N 2 = log 2 N) edges. This paper establishes a matching upper bound on the number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00300-9